<h2>DESCRIPTION</h2>

<em>v.delaunay</em> uses an existing vector points map (<b>input</b>)
to create a Delaunay triangulation vector map (<b>output</b>).
<p>
Delaunay triangulation example (red-yellow points are the data points from which the triangulation was generated):
<center>
<img src="v_delaunay.png" border="1">
</center>


<h2>EXAMPLE</h2>

Commands used with the North Carolina dataset to create the above figure (subset shown in figure).
<div class="code"><pre>
g.region n=220750 s=219950 w=638300 e=639000 -p
v.delaunay input=elev_lid792_randpts output=elev_lid792_randpts_delaunay
</pre></div>


<h2>REFERENCES</h2>
<em>Leonid Guibas and Jorge Stolfi, (1985). Primitives for the 
Manipulation of General Subdivisions and the Computation of
Voronoi Diagrams, ACM Transactions on Graphics, Vol 4, No. 2, 
April 1985, Pages 74-123
</em>


<h2>SEE ALSO</h2>
<em>
<a href="v.voronoi.html">v.voronoi</a>, 
<a href="v.hull.html">v.hull</a>
</em>


<h2>AUTHORS</h2>
Martin Pavlovsky, Google Summer of Code 2008, Student<br>
Paul Kelly, Mentor<br>
Based on "dct" by Geoff Leach, Department of Computer Science, RMIT.<br>

<!--
<p>
<i>Last changed: $Date$</i>
-->
